package com.sxu.greedy.day2;

/**
 * 摆动序列
 */
public class Test4 {
    public int wiggleMaxLength(int[] nums) {
        int n = nums.length;
        if(n < 2){
            return n;
        }
        int ret = 0;
        int left = 0;
        for(int i =0;i<n-1;i++){
            int right = nums[i+1] - nums[i];
            if(right == 0)
                continue;
            if(left * right <= 0){
                ret ++;
            }
            left = right;
        }
        return ret + 1;
    }
}
